Course Notes on Theory and Practice of Algorithms – Part I : Algorithmic Learning

نویسنده

  • Thomas Zeugmann
چکیده

This report contains the course notes of Part I of Theory and Practice of Algorithms. Within this part we deal with algorithmic learning. Some learning algorithms for fundamental learning problems are studied. Furthermore, we focus our attention on the complexity theoretical issues involved. In addition to the usual wort-case analysis, we also deal with the average-case behavior. Therefore, one lecture is devoted to introduce the subject of average-case analysis of algorithms. Finally, after having gained a deeper understanding of what algorithmic learning really is, we exemplify the application of algorithmic learning to the field of data mining.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lectures on Frugal Mechanism Design

These lecture notes cover two lectures from EECS 510, Algorithmic Mechanism Design, offered at Northwestern University in the Spring 2008 term. They cover the topic of frugality in mechanism design. Prerequisites for reading these lecture notes are basic understanding of algorithms and complexity as well as elementary calculus and probability theory. I will also assume that the reader has acces...

متن کامل

Advanced Algorithms Lecture Notes

Preface This is a set of lecture notes for the 3rd year course " Advanced Algorithms " which I gave in Tsinghua University for Yao-class students in the Spring and Fall terms in 2011. This set of notes is partially based on the notes scribed by students taking the course the first time it was given. Many thanks to Xiahong Hao and Nathan Hobbs for their hard work in critically revising, editing,...

متن کامل

Computational Learning Theory Lecture Notes for CS Spring Semester

1 Preface This manuscript is a compliation of lecture notes from the graduate level course CS 582, \Computational Learning Theory," I taught a t W ashington University in the spring of 1991. Students taking the course were assumed to have b a c kground in the design and analysis of algorithms as well as good mathematical background. Given that there is no text available on this subject, the cou...

متن کامل

Algorithms for Computing Solution Concepts in Game Theory

These are notes for the first five lectures of the course on Algorithmic Game Theory, given (starting November 2008) in the Weizmann Institute jointly by Uriel Feige, Robert Krauthgamer and Moni Naor. The lecture notes are not intended to provide a comprehensive view of solution concepts in game theory, but rather discuss some of the algorithmic aspects involved. Hence some of the definitions w...

متن کامل

1 The Vickrey Auction and Algorithmic Mechanism

These are lecture notes for one third of the class CS364B, Topics in Algorithmic Game Theory, offered at Stanford University in the Fall 2005 term. They cover the topic of combinatorial auctions, with an undeniably strong bias toward recent work by the “STOC/FOCS” (algorithms and complexity) community. I assume that the reader has a solid background in undergraduate algorithms and complexity; o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005